Generalized Vertex-Rankings of Partial k-trees

نویسندگان

  • Abul Kashem
  • Xiao Zhou
  • Takao Nishizeki
چکیده

Md. Abul Kashem 1, Xiao Zhou 2 and Takao Nishizeki 1 1 Graduate School of Information Sciences z Education Center for Information Processing Tohoku University, Senda2 980-77, 3apan. E~aail : [email protected], [email protected] [email protected] Abst ract . A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with integers such that, for any label i, deletion of all vertices with labels > i leaves connected components, each having at most c vertices with label i. We present a polynomialtime algorithm to find a c-vertex-ranklng of a partial k-tree using the minimum number of ranks for any bounded integers c and k.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex rankings of chordal graphs and weighted trees

In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem of vertex ranking of weighted trees to the vertex ranking of (simple) chordal graphs, which proves that the latter problem is NP-hard. In this way we solve an open problem of Aspvall and Heggernes. We use this reduction ...

متن کامل

Branches in random recursive k-ary trees

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

متن کامل

Algorithms for Vertex Partitioning Problems on Partial k-Trees

In this paper, we consider a large class of vertex partitioning problems and apply to them the theory of algorithm design for problems restricted to partial k-trees. We carefully describe the details of algorithms and analyze their complexity in an attempt to make the algorithms feasible as solutions for practical applications. We give a precise characterization of vertex partitioning problems,...

متن کامل

On the fixed point theorems in generalized weakly contractive mappings on partial metric spaces

In this paper, we prove a fixed point theorem for a pair of generalized weakly contractive mappings in complete partial metric spaces. The theorems presented are generalizations of very recent fixed point theorems due to Abdeljawad, Karapinar and Tas. To emphasize the very general nature of these results, we illustrate an example.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997